3 as a Ninth Power (mod $p$).
نویسندگان
چکیده
منابع مشابه
On primitive roots of 1 mod p k, divisors of p ± 1, Wieferich primes, and quadratic analysis mod p 3
On primitive roots of 1 mod p k , divisors of p ± 1, Wieferich primes, and quadratic analysis mod p Abstract Primitive roots of 1 mod p k (k > 2 and odd prime p) are sought, in cyclic units group G k ≡ A k B k mod p k , coprime to p, of order (p − 1)p k−1. 'Core' subgroup A k has order p − 1 independent of precision k, and 'extension' subgroup B k of all p k−1 residues 1 mod p is generated by p...
متن کاملA Degree-Decreasing Lemma for (MOD q - MOD p) Circuits
Consider a (MODq;MODp) circuit, where the inputs of the bottom MODp gates are degree-d polynomials with integer coefficients of the input variables (p, q are different primes). Using our main tool — the Degree Decreasing Lemma — we show that this circuit can be converted to a (MODq;MODp) circuit with linear polynomials on the input-level with the price of increasing the size of the circuit. Thi...
متن کاملNOTES ON PRIMES P ⌘ 1 mod D AND A P � 1 / D ⌘ 1 mod
Let d > 0 be a squarefree integer and a be an integer, which is not 1 nor a square. Let P(a,d)(x) be the number of primes p x such that p ⌘ 1 mod d and a(p 1)/d ⌘ 1 mod p. Numerical data indicate that the function as approximately equal to a constant multiple of ⇡(x)/(d'(d)) for su ciently large x, where ⇡(x) is the number of primes up to x and '(d) is the Euler-' function. The involved const...
متن کاملRANK p − 1 MOD - p H - SPACES
Different constructions by Cooke, Harper and Zabrodsky and by Cohen and Neisendorfer produce torsion free finite p-local H-spaces of rank l < p−1. The first construction goes through when l = p− 1 and we show the second does as well. However, the space produced need not be an H-space. We give a criterion for when an H-space is obtained. In the special case of rank 2 mod-3 H-spaces, we also give...
متن کاملA New Algorithm for Inversion mod p
A new algorithm for computing x = a−1 (mod pk) is introduced. It is based on the exact solution of linear equations using p-adic expansions. It starts with the initial value c = a−1 (mod p) and iteratively computes the digits of the inverse x = a−1 (mod pk) in base p. The mod 2 version of the algorithm is significantly more efficient than the existing algorithms for small values of k. We also d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1974
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-11555